Deterministic Parallel Graph Coloring with Symmetry Breaking
نویسندگان
چکیده
In this paper we propose a deterministic parallel graph coloring algorithm that enables Multi-Coloring in parallel for sparse undirected graphs by coarse-grained segmentation and symmetry breaking. The proposed algorithm is implemented and tested on standard problem instances from engineering applications and benchmarked against various deterministic graph coloring algorithms. Quantified results show that the proposed algorithm is competitive or better than the sequential Multi-Coloring algorithm with respect to execution time on multi-core architectures. The upper bound on the number of colors is guaranteed to be the same as for the Multi-Coloring algorithm.
منابع مشابه
Distributed Graph Coloring: Fundamentals and Recent Developments
The focus of this monograph is on symmetry breaking problems in the message-passing model of distributed computing. In this model a communication network is represented by a n-vertex graph G = (V,E), whose vertices host autonomous processors. The processors communicate over the edges of G in discrete rounds. The goal is to devise algorithms that use as few rounds as possible. A typical symmetry...
متن کاملThe Randomized Coloring Procedure with Symmetry-Breaking
A basic randomized coloring procedure has been used in probabilistic proofs to obtain remarkably strong results on graph coloring. These results include the asymptotic version of the List Coloring Conjecture due to Kahn, the extensions of Brooks’ Theorem to sparse graphs due to Kim and Johansson, and Luby’s fast parallel and distributed algorithms for graph coloring. The most challenging aspect...
متن کاملSymmetry Breaking in Trees and Planar Graphs by Vertex Coloring
An undirected graph G is said to be d-distinguishable if there is a d-coloring of its vertex set V (G) such that no nontrivial automorphism of G preserves the coloring. The distinguishing number of a graph G is the minimum d for which it is d-distinguishable. In this paper we design efficient algorithms for computing the distinguishing numbers of trees and planar graphs.
متن کاملDeterministic Parallel Graph Coloring with Repartitioning by Auxiliary Graph Coloring
In this paper we propose a deterministic parallel graph coloring algorithm that enables Multi-Coloring in parallel for sparse undirected graphs by coarse-grained segmentation and auxiliary graph coloring. The proposed algorithm is implemented and tested on standard problem instances from engineering applications and benchmarked against various relevant deterministic graph coloring algorithms. Q...
متن کاملAn Optimal Distributed $(\Delta+1)$-Coloring Algorithm?
Vertex coloring is one of the classic symmetry breaking problems studied in distributed com-puting. In this paper we present a new algorithm for (∆ + 1)-list coloring in the randomizedLOCAL model running in O(log n + Detd(poly logn)) time, where Detd(n ′) is the determinis-tic complexity of (deg+1)-list coloring (v’s palette has size deg(v) + 1) onn′-vertex graphs.This impro...
متن کامل